منابع مشابه
Non-cooperative solutions for estate division problems
In an estate division problem an estate has to be divided among several players whose total entitlement to the estate exceeds its size. This paper extends the noncooperative approach through a claim game, as initiated by O’Neill (1982), by allowing players to put multiple claims on the same part of the estate, and by considering the case where individual entitlements may exceed the estate. A fu...
متن کاملNon-manipulable division rules in claim problems and generalizations
When resources are divided among agents, the characteristics of the agents are taken into consideration. A simple example is the bankruptcy problem, where the liquidation value of a bankrupt firm is divided among the creditors based on their claims. We characterize division rules under which no group of agents can increase the total amount they receive by transferring their characteristics with...
متن کاملA non-cooperative support for equal division in estate division problems
We consider estate division problems and show that for any claim game based on a (estate division) rule satisfying efficiency, equal treatment of equals, and order preservation of awards, all (pure strategy) Nash equilibria induce equal division. Next, we consider (estate division) rules satisfying efficiency, equal treatment of equals, and claims monotonicity. Then, for claim games with at mos...
متن کاملA strategic approach to multiple estate division problems
The classical bankruptcy problem (O’Neill, 1982) is extended by assuming that there are multiple estates to be divided. In the finite case, there are finitely many estates and the agents have homogenous preferences, i.e., constant utilities, per estate, but preferences may differ across estates. In the general case, i.e., the infinite estate problem, players have arbitrary preferences over an i...
متن کاملUniform Circuits for Division: Consequences and Problems
Integer division has been known to lie in P-uniform TC since the mid1980’s, and recently this was improved to L-uniform TC. At the time that the results in this paper were proved and submitted for conference presentation, it was unknown whether division lay in DLOGTIME-uniform TC (also known as FOM). We obtain tight bounds on the uniformity required for division, by showing that division is com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2019
ISSN: 0899-8256
DOI: 10.1016/j.geb.2018.11.002